Refined Reliability Combining for Binary Message Passing Decoding of Product Codes

نویسندگان

چکیده

We propose a novel soft-aided iterative decoding algorithm for product codes (PCs). The proposed algorithm, named bounded distance with combined reliability (iBDD-CR), enhances the conventional (iBDD) of PCs by exploiting some level soft information. In particular, iBDD-CR can be seen as modification iBDD where hard decisions row and column decoders are made based on estimate BDD outputs. estimates derived using extrinsic message passing generalized low-density-parity check (GLDPC) ensembles, which encompass PCs. perform density evolution analysis transmission over additive white Gaussian noise channel GLDPC ensemble. consider both binary bit-interleaved coded modulation quadrature amplitude modulation.We show that achieves performance gains up to $0.51$ dB compared same internal decoder data flow. This makes an attractive solution very high-throughput applications such fiber-optic communications.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Message Passing Algorithm for Iterative Decoding of Channel Codes

Packet data broadcast systems require error free delivery of packet data without retransmission requests. Turbo codes can be used to achieve very low packet error rates. To achieve this low error rate with a very small gap from the system capacity, several design considerations need to be made. We need to use higher constraintlength codes (increasing complexity exponentially) with larger block ...

متن کامل

Design of LDPC Codes Robust to Noisy Message-Passing Decoding

We address noisy message-passing decoding of lowdensity parity-check (LDPC) codes over additive white Gaussian noise channels. Message-passing decoders in which certain processing units iteratively exchange messages are common for decoding LDPC codes. The exchanged messages are in general subject to internal noise in hardware implementation of these decoders. We model the internal decoder noise...

متن کامل

Message-Passing Decoding on Self-dual F4-additive Codes

In this thesis we work with message-passing decoding on self-dual F4-additive codes. We present and disprove the a decoding scheme proposed by Parker et al. in an unpublished manuscript [17]. We refer to this scheme as Embedded Factor Graph decoding. The method of Discriminative decoding is developed and described in this work as a replacement for the embedded decoding. It is shown to be exact ...

متن کامل

Graph-Cover Decoding and Finite-Length Analysis of Message-Passing Iterative Decoding of LDPC Codes

The goal of the present paper is the derivation of a framework for the finite-length analysis of message-passing iterative decoding of low-density parity-check codes. To this end we introduce the concept of graph-cover decoding. Whereas in maximum-likelihood decoding all codewords in a code are competing to be the best explanation of the received vector, under graph-cover decoding all codewords...

متن کامل

Bounded-Distance Soft Decision Decoding of Binary Product Codes

A. two-step sub-optimal algorithm for decoding binary product codes is discussed. This algorithm realizes at least half the minimum Euclidean distance of the code. The fundamental geometric properties associated with the algorithm are investigated, and bounds on the number of nearest neighbors are derived. This investigation also results with an improved algorithm which achieves the minimum eff...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Lightwave Technology

سال: 2021

ISSN: ['0733-8724', '1558-2213']

DOI: https://doi.org/10.1109/jlt.2021.3081586